Distributed Steiner Tree Algorithm and its Application in Ad Hoc Wireless Networks
نویسنده
چکیده
In dominating set problem, we are required to find a minimum size subset of vertices that each vertex is either in the dominating set or adjacent to some node in the dominating set. In this paper, we concentrate on the related problem of finding a connected dominating set of minimum size in which the graph induced by nodes in the dominating set are required to be connected. Instead of conventional spanning tree model, we used Steiner tree in unitdisk graph to connect nodes. The main contributions of this work are fully distributed Steiner tree with approximation ratio of 2 and as an application of the proposed approximation, a fully distributed algorithm for multicast backbone structure with an approximation ration of at most 10. The main advantage of the algorithm is that it simplifies the routing process to one in a smaller subnetwork.
منابع مشابه
Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملAssessment of DSACC and QPART Algorithms in Ad Hoc Networks
The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...
متن کاملMobility-based Multicast Routing Algorithm in Wireless Mobile Ad-Hoc Networks: A Learning Automata Approach
In this paper, we propose a distributed learning automata-based algorithm to solve the multicast routing problem in wireless mobile ad-hoc networks. The proposed algorithm estimates the expected relative mobility of each host, by sampling its movement parameters in various epochs, to realistically predict its motion behavior, and takes advantage of the Steiner connected dominating set to form t...
متن کاملWeighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs
In this paper, we first propose three centralized learning automata-based heuristic algorithms for approximating a near optimal solution to the minimum weight Steiner connected dominating set (WSCDS) problem. Finding the Steiner connected dominating set of the network graph is a promising approach for multicast routing in wireless ad-hoc networks. Therefore, we present a distributed implementat...
متن کاملDistributed Constrained Steiner Tree Algorithm for Multicast in Ad hoc Networks
The paper formally defines the problem of constrained Steiner tree (CST) in the context of wireless ad hoc networks. In contrast to wired networks, due to the broadcast nature of wireless communications, the notion of cost and delay is defined based on node, rather than link. By adapting the metaphor of Swarm Intelligence, the paper describes a distributed and asynchronous algorithm, termed CST...
متن کامل